Ideals and graphs, Gröbner bases and decision procedures in graphs

نویسندگان

Giuseppa Carrá Ferro

Daniela Ferrarello

چکیده

The well known correspondence between even cycles of an undirected graph and polynomials in a binomial ideal associated to a graph is extended to odd cycles and polynomials in another binomial ideal. Other binomial ideals associated to an undirected graph are also introduced. The results about them with topics on monomial ideals are used in order to show decision procedures for bipartite graphs, minimal vertex covers, cliques, edge covers and matchings with algebraic tools. All such procedures are implemented in Maple 9.5.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Ring graphs and complete intersection toric ideals

We study the family of graphs whose number of primitive cycles equals its cycle rank. It is shown that this family is precisely the family of ring graphs. Then we study the complete intersection property of toric ideals of bipartite graphs and oriented graphs. An interesting application is that complete intersection toric ideals of bipartite graphs correspond to ring graphs and that these ideal...

متن کامل

Gröbner Bases and Nullstellensätze for Graph-Coloring Ideals

We revisit a well-known family of polynomial ideals encoding the problem of graph-kcolorability. Our paper describes how the inherent combinatorial structure of the ideals implies several interesting algebraic properties. Specifically, we provide lower bounds on the difficulty of computing Gröbner bases and Nullstellensatz certificates for the coloring ideals of general graphs. For chordal grap...

متن کامل

Properties of Cut Ideals Associated to Ring Graphs

A cut ideal of a graph records the relations among the cuts of the graph. These toric ideals have been introduced by Sturmfels and Sullivant who also posed the problem of relating their properties to the combinatorial structure of the graph. We study the cut ideals of the family of ring graphs, which includes trees and cycles. We show that they have quadratic Gröbner bases and that their coordi...

متن کامل

1 N ov 2 00 6 COMBINATORIAL SYMBOLIC POWERS

Symbolic powers of ideals are studied in the combinatorial context of monomial ideals. When the ideals are generated by quadratic squarefree monomials, the generators of the symbolic powers are obstructions to vertex covering in the associated graph and its blow-ups. As a result, perfect graphs play an important role in the theory, dual to the role played by perfect graphs in the theory of seca...

متن کامل